ANOTHER ADAPTIVE DISTRIBUTED SHORTEST PATH ALGORITHM Pierre
نویسنده
چکیده
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the FordBellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge MA 02139. This research was supported in part by Codex Corporation and in part by the Army Research Office under Grant No. DAAL03-86-K-0171.
منابع مشابه
An Adaptive Distributed Dijkstra Shortest Path Algorithm
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملFault Tolerant Routing in Mesh Topologies
Fault tolerant routing refers to transfer of messages from a source to destination in a network with faulty links and/or nodes. Fault tolerant routing is one of the key problems in designing robust distributed algorithms. Internet routing protocols like BCG are also examples of adaptive routing algorithms. Adaptive routing in distributed systems can be desirable at either the application level ...
متن کاملDistributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing
In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. Th...
متن کاملDistributed network protocols for changing topologies: a counterexample
A number of distributed network protocols for reliable data transmission, connectivity test, shortest path and topology broadcast have been proposed with claims that they operate correctly in the face of changing topology, without need for unbounded numbers to identify different runs of the algorithms. This paper shows that they do not possess all the claimed properties and that they may not te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991